Óùò Êêê Blockinððøý Ò Ó ×ýò Blockinöóòóù× Ëý×øøñ× Í××òò ××óò Ööñ×

Abstra t. Bounded rea hability or model he king is widely believed to work poorly when using de ision diagrams instead of SAT pro edures. Re ent resear h suggests this to be untrue with regards to syn hronous systems, parti ularly digital ir uits. This paper shows that the belief is also a myth for asyn hronous systems, su h as models spe i ed by Petri nets. We propose Bounded Saturation, a new algorithm to ompute bounded state spa es using Multi-way De ision Diagrams (MDDs). This is based on the established Saturation algorithm whi h bene ts from a non-standard sear h strategy that is very di erent from breadthrst sear h. To bound Saturation, we employ Edge-Valued MDDs and rework its sear h strategy. Experimental results show that our algorithm often, but not always, ompares favorably against two SAT-based approa hes advo ated in the literature for deadlo k he king in Petri nets.